Eecient Computation of Behavior Strategies

نویسنده

  • Bernhard von Stengel
چکیده

We propose the sequence form as a new strategic description for an extensive game with perfect recall. It is similar to the normal form but has linear instead of exponential complexity, and allows a direct representation and eecient computation of behavior strategies. Pure strategies and their mixed strategy probabilities are replaced by sequences of consecutive choices and their realization probabilities. A zero-sum game is solved by a corresponding linear program that has linear size in the size of the game tree. General two-person games are studied in the paper by Koller, Megiddo, and von Stengel in this journal issue.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient computation of fixpoints that arise in complex program analysis

This paper presents an eecient algorithm for solving the xpoints that arise in complex program analysis based on abstract interpretation. The algorithm behaves like those based upon interval analysis of a ow graph, but without requiring the ow graph to be given a priori. In the general case, the structure of the x-point computation is not known prior to analysis. In the algorithm, the entailmen...

متن کامل

Transformations for Efficient Evaluations in Functional Programming

Rewriting is a suitable mechanism to implement functional programming languages. The deenition of eecient evaluation strategies is a natural concern in this setting. Recently we have shown that, by imposing some simple restrictions on the replacements which are allowed for the arguments of functions, we can obtain eecient head-evaluations of terms in a certain class of programs. We are also abl...

متن کامل

Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms

Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high performance computers with memory hierarchies non-trivial. In this paper we present our ndings on eecient implementation of Strassen's algorithmm17] for the ubiquitous operation of matrix multiplication as a model for a class of recursive algorithms. In comparison to...

متن کامل

The Role of the Manager in a Noncooperative Network yYannis

In noncooperative networks users make control decisions that optimize their individual performance objectives. Nash equilibria characterize the operating points of such networks. Nash equilibria exhibit, in general, suboptimal network performance. Focusing on routing , a methodology is devised for overcoming this dee-ciency, through the intervention of the network manager. The manager controls ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996